System for discovering hidden correlation relationships for risk analysis using graph-based machine learning

ABSTRACT

A system, method, and computer readable device that detects hidden correlation relationships among entities, such as companies and/or individuals is presented. A dataset that corresponds to a predefined set of correlation relationships of these companies and/or individuals may be collected. The dataset may be stored in a graph database and a machine learning system may be built using features computed from the graph database. At least a new pair of companies or a new pair of an individual and a company may be evaluated. The system, method, and/or computer readable device may determine whether a hidden correlation relationship exists between them.

CROSS REFERENCE TO RELATED APPLICATIONS

This application claims priority to and claims the benefit of U.S.Provisional Patent Application No. 62/634,883, filed on Feb. 25, 2018,which is hereby incorporated by reference in its entirety.

FIELD OF THE INVENTION

The present application relates to artificial intelligence technologies,machine learning technologies, relationship detection technologies, riskanalysis technologies, and computing technologies, and moreparticularly, to a system and method for discovering hidden correlationrelationships for risk analysis using graph-based machine learning.

BACKGROUND

In today's society, entities, such as businesses, have an increasingneed to properly assess the risks affecting their businesses. Risks, ifnot effectively detected, avoided or dealt with, may adversely affect abusiness's profits, reputation, and client base. As an example, bankshave tens of thousands of companies and individual clients as theirborrowers for various bank products, such as loans. When a companyclient applies for a loan, the risk and underwriting departments of abank typically needs to consider this company's correlationrelationships with other clients in addition to evaluating the company'sindividual credentials so that the bank can have a comprehensive pictureof the credit and financial conditions of the company client. Notably,there are many correlation relationships among companies and individualclients. For example, correlation relationships include, but are notlimited to, stock holding correlation relationships, guaranteecorrelation relationships, collateral correlation relationships, tradingcorrelation relationships, other types of correlation relationships, ora combination thereof. A complete and accurate characterization of thesecorrelation relationships among clients can improve the bank'sunderstanding of risks involved with the clients' loans. However, inpractice, it is very common that a hidden correlation relationshipexits. For example, an individual may hide his actual control overseveral companies and may use someone else to act as his cover-up insome of these companies for financing or tax purposes. Therefore, twocompanies that are applying for loans may appear to be independententities, but, in fact, they belong to the same corporate entity or thesame actual owner. These circumstances are not unusual, especially incountries where government and banking regulations are insufficient.This poses a major risk for banks. As a result, it would be desirablefor banks and other entities to have a way to reveal these hiddencorrelation relationships. Traditionally, banks have resorted tomethods, such as conducting client visits and investigation as part ofdue diligence or performing correlation-relationship finding from adatabase based on some predefined rules. Nevertheless, such techniquesare not effective enough in detecting such hidden correlationrelationships and mitigating risk. As a result, current technologies andprocesses may be modified and improved so as to provide enhancedfunctionality and features for entities, users, or both. Suchenhancements and improvements may provide for improved quality ofservice, improved interactions between entities and users, increasedefficiencies, increased access to meaningful data, andsubstantially-improved decision-making abilities for entities,particularly when hidden correlation relationships are effectivelydiscovered before negative impacts are felt by the entities.

SUMMARY

A system and accompanying methods for discovering hidden correlationrelationships for risk analysis using graph-based machine learning aredisclosed. In particular, the system and accompanying methods utilizemachine learning to detect hidden correlation relationships based on theknowledge learned from the data of a number of clients, which are storedusing graph database. In certain embodiments, the system and methodsprovide a graph and machine learning-based solution for entities, suchas banks, to discover hidden correlation relationships among companiesand individuals. A dataset may be collected that consists of informationabout tens of thousands of clients that includes, but is not limited to,credit histories, financial information, trading and economicinformation, shareholder information, and transactional information. Thedata source for the dataset may include, but is not limited to, thebank's own records including information provided through the loanapplication, government agencies, news media and social networks, thecompany's own public announcements, or a combination thereof.Correlation relationships may be extracted, and a graph may be createdwith the correlation relationships and other information about theclients. The vertex of the graph may be a company, an individual, or anytype of entity. The edge may represent a certain kind of correlationrelationship. The edge may be directional or unidirectional and it mayalso have a weight. On certain occasions, there could be one or multipleedges between two vertexes indicating one or multiple correlationrelationships. From the graph database, a set of features may becomputed that is indicative of the proximity of two vertexes. The closerthe two vertexes are, the more likely that they may have a certaincorrelation relationship. Training data may be created from the dataavailable at the graph database. A machine learning system may be builtusing the training data and may predict the probability of a hiddencorrelation relationship between pairs of nodes from the graph, i.e.,companies and individuals. In certain embodiments, the hiddencorrelation relationship discovery may be achieved through supervisedclassification. The description provided in this disclosure focuses onfinding hidden relationship between two vertexes, but similar methodscan be used to find hidden relationships among a group of multiplevertexes. For example, the method presented in this disclosure can beiteratively run for each pair of the nodes in the group.

To that end, in one embodiment according to the present disclosure, asystem for discovering hidden correlation relationships for riskanalysis using graph-based machine learning is disclosed. The system mayinclude a memory that stores instructions and a processor that executesthe instructions to perform operations conducted by the system. Thesystem may perform an operation that includes collecting data associatedwith known correlation relationships that exist among a plurality ofentities, wherein the data comprises information associated with theknown correlation relationships and an indication of a strength of theknown correlation relationships. The system may then perform anoperation that includes generating a graph based on the knowncorrelation relationships and the strength of the known correlationrelationships, wherein vertexes of the graph correspond to the pluralityof entities and edges of the graph correspond to the known correlationrelationships. The system may proceed to perform an operation thatincludes computing, based on the graph, a set of features andcorresponding labels for the plurality of entities. Once the set offeatures for the plurality of entities is computed, the system mayperform an operation that includes training a machine learning modelusing the computed set of features and the corresponding labels. Thesystem may then perform an operation that includes determining a hiddencorrelation relationship for at least one pair of the plurality ofentities by utilizing machine learning model trained with the computedset of features.

In another embodiment, a method for discovering hidden correlationrelationships for risk analysis using graph-based machine learning isdisclosed. The method may include utilizing a memory that storesinstructions, and a processor that executes the instructions to performthe various functions of the method. The method may include accessingdata associated with known correlation relationships that exist among aplurality of entities, wherein the data comprises information associatedwith the known correlation relationships and an indication of a strengthof the known correlation relationships. Additionally, the method mayinclude generating a graph based on the known correlation relationshipsand the strength of the known correlation relationships, whereinvertexes of the graph correspond to the plurality of entities and edgesof the graph correspond to the known correlation relationships. Themethod may also include computing, based on the graph, a set of featuresand corresponding labels for the plurality of entities. Furthermore, themethod may include training a machine learning model using the computedset of features and the corresponding labels. Moreover, the method mayinclude determining a hidden correlation relationship for at least onepair of the plurality of entities by utilizing machine learning modeltrained with the computed set of features.

According to yet another embodiment, a computer-readable device havinginstructions for discovering hidden correlation relationships for riskanalysis using graph-based machine learning is provided. The computerinstructions, which when loaded and executed by a processor, may causethe processor to perform operations including: receiving data associatedwith known correlation relationships that exist among a plurality ofentities, wherein the data comprises information associated with theknown correlation relationships and an indication of a strength of theknown correlation relationships; generating a graph based on the knowncorrelation relationships and the strength of the known correlationrelationships, wherein vertexes of the graph correspond to the pluralityof entities and edges of the graph correspond to the known correlationrelationships; computing, based on the graph, a set of features andcorresponding labels for the plurality of entities; training a machinelearning model using the computed set of features and the correspondinglabels; and determining a hidden correlation relationship for at leastone pair of the plurality of entities by utilizing machine learningmodel trained with the computed set of features.

These and other features of the systems and methods for discoveringhidden correlation relationships for risk analysis using graph-basedmachine learning are described in the following detailed description,drawings, and appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic diagram of a system for discovering hiddencorrelation relationships for risk analysis using graph-based machinelearning according to an embodiment of the present disclosure.

FIG. 2 depicts a first schematic diagram illustrating a simple graphshowing the correlation relationship between an individual and twocompanies and a second schematic diagram showing multiple correlationrelationships among two individuals and three companies. The secondschematic diagram is a more complicated graph with multipleindividuals/companies and multiple correlation relationships. There arefive vertexes, i.e., persons John and Alice, Companies A, B and C. Johnis the shareholder of Companies A and B, while Alice is the shareholderof Companies B and C. Company B provides a guarantee to company A in aloan application. Companies A and C provide collateral to Company B inloan applications, while Company C provides collateral to company A inanother loan application.

FIG. 3 is a schematic diagram illustrating steps for developing asolution to hidden relationship discovery including link prediction andlink completion.

FIG. 4 is a schematic diagram illustrating a machine learning solutionflow diagram for a training process for use with the system of FIG. 1 .The flow chart diagram shows how a machine learning model is trainedusing features extracted from a graph database. For supervisedclassification learning and regression problems, a training target maybe provided at the right end.

FIG. 5 is a schematic diagram illustrating known correlations forvarious companies and individuals in a specific use-case scenario topredict hidden correlation relationships.

FIG. 6 is a schematic diagram illustrating a process for computingfeatures from graphs that are utilized as training data for a model foruse with the system of FIG. 1 .

FIG. 7 is a schematic diagram illustrating further informationassociated with the process for computing features from graphs for useas training data for a model for use with the system of FIG. 1 .

FIG. 8 is a schematic diagram illustrating a reduction of the graphpresented in FIG. 7 . The reduced graph is created by removing the edgebetween John and Company A. Features about John and Company A may becomputed from this new reduced graph.

FIG. 9 is a diagram illustrating additional examples of a transformedgraph.

FIG. 10 is schematic diagram illustrating how graph features may becomputed based on transformed graphs and used for a machine learningmodel.

FIG. 11 is a schematic diagram illustrating sample graph features foruse with the system of FIG. 1 .

FIG. 12 is a diagram illustrating sample non-graph features for aproperty.

FIG. 13 is a schematic diagram illustrating training of a machinelearning model by utilizing features computing from graphs.

FIG. 14 is a schematic diagram illustrating a prediction made by themachine learning model with regard to a hidden correlation relationshipin a sample use case scenario.

FIG. 15 is a flow diagram illustrating a sample method for discoveringhidden correlation relationships for risk analysis using graph-basedmachine learning according to an embodiment of the present disclosure.

FIG. 16 is a schematic diagram of a machine in the form of a computersystem within which a set of instructions, when executed, may cause themachine to perform any one or more of the methodologies or operations ofthe systems and methods for discovering hidden correlation relationshipsfor risk analysis using graph-based machine learning.

DETAILED DESCRIPTION OF THE INVENTION

As shown in FIGS. 1-16 , a system 100 for discovering hidden correlationrelationships for risk analysis using graph-based machine learning isdisclosed. The system 100 may be configured to support, but is notlimited to supporting, artificial intelligence and machine learningservices, data and content services, computing applications andservices, cloud computing services, internet services, satelliteservices, telephone services, software as a service (SaaS) applications,mobile applications and services, and any other computing applicationsand services. The system may include a first user 101, who may utilize afirst user device 102 to access data, content, and applications, or toperform a variety of other tasks and functions. As an example, the firstuser 101 may utilize first user device 102 to access an application(e.g. a browser or a mobile application) executing on the first userdevice 102 that may be utilized to access web pages, data, and contentassociated with the system 100. In certain embodiments, the first user101 may be any type of user that may potentially desire to obtain a loanfrom a bank that the second user 110 is an employee of.

The first user device 102 utilized by the first user 101 may include amemory 103 that includes instructions, and a processor 104 that executesthe instructions from the memory 103 to perform the various operationsthat are performed by the first user device 102. In certain embodiments,the processor 104 may be hardware, software, or a combination thereof.The first user device 102 may also include an interface 105 (e.g.screen, monitor, graphical user interface, etc.) that may enable thefirst user 101 to interact with various applications executing on thefirst user device 102, to interact with various applications executingwithin the system 100, and to interact with the system 100 itself. Incertain embodiments, the first user device 102 may be a computer, alaptop, a tablet device, a phablet, a server, a mobile device, asmartphone, a smart watch, a robot, and/or any other type of computingdevice. Illustratively, the first user device 102 is shown as a mobiledevice in FIG. 1 . The first user device 102 may also include a globalpositioning system (GPS), which may include a GPS receiver and any othernecessary components for enabling GPS functionality, accelerometers,gyroscopes, sensors, and any other componentry suitable for a mobiledevice.

In addition to the first user 101, the system 100 may include a seconduser 110, who may utilize a second user device 111 to access data,content, and applications, or to perform a variety of other tasks andfunctions. As indicated above, the second user 110 may be an employee ofa bank that issues loans to individuals and entities. Much like thefirst user 101, the second user 110 may utilize second user device 111to access an application (e.g. a browser or a mobile application)executing on the second user device 111 that may be utilized to accessweb pages, data, and content associated with the system 100. The seconduser device 111 may include a memory 112 that includes instructions, anda processor 113 that executes the instructions from the memory 112 toperform the various operations that are performed by the second userdevice 111. In certain embodiments, the processor 113 may be hardware,software, or a combination thereof. The second user device 111 may alsoinclude an interface 114 (e.g. a screen, a monitor, a graphical userinterface, etc.) that may enable the second user 110 to interact withvarious applications executing on the second user device 111, tointeract with various applications executing in the system 100, and tointeract with the system 100. In certain embodiments, the second userdevice 111 may be a computer, a laptop, a tablet device, a phablet, aserver, a mobile device, a smartphone, a smart watch, a robot, and/orany other type of computing device. Illustratively, the second userdevice 111 may be a computing device in FIG. 1 . The second user device111 may also include any of the componentry described for first userdevice 102.

In certain embodiments, the first user device 102 and the second userdevice 111 may have any number of software applications and/orapplication services stored and/or accessible thereon. For example, thefirst and second user devices 102, 111 may include artificialintelligence-based applications, machine learning-based applications,applications for facilitating the completion of tasks, applications fororiginating loans and/or other banking products, cloud-basedapplications, search engine applications, natural language processingapplications, database applications, algorithmic applications,phone-based applications, product-ordering applications, businessapplications, investment applications, e-commerce applications, mediastreaming applications, content-based applications, databaseapplications, gaming applications, internet-based applications, browserapplications, mobile applications, service-based applications,productivity applications, video applications, music applications,social media applications, presentation applications, any other type ofapplications, any types of application services, or a combinationthereof. In certain embodiments, the software applications and servicesmay include one or more graphical user interfaces so as to enable thefirst and second users 101, 110 to readily interact with the softwareapplications. The software applications and services may also beutilized by the first and second users 101, 110 to interact with anydevice in the system 100, any network in the system 100, or anycombination thereof. For example, the software applications executing onthe first and second user devices 102, 111 may be applications forreceiving data, applications for storing data, applications forreceiving demographic and preference information, applications fortransforming data, applications for executing mathematical algorithms,applications for generating and transmitting electronic messages,applications for generating and transmitting various types of content,any other type of applications, or a combination thereof. In certainembodiments, the first and second user devices 102, 111 may includeassociated telephone numbers, internet protocol addresses, deviceidentities, or any other identifiers to uniquely identify the first andsecond user devices 102, 111 and/or the first and second users 101, 110.In certain embodiments, location information corresponding to the firstand second user devices 102, 111 may be obtained based on the internetprotocol addresses, by receiving a signal from the first and second userdevices 102, 111, or based on profile information corresponding to thefirst and second user devices 102, 111.

The system 100 may also include a communications network 135. Thecommunications network 135 of the system 100 may be configured to linkeach of the devices in the system 100 to one another. For example, thecommunications network 135 may be utilized by the first user device 102to connect with other devices within or outside communications network135. Additionally, the communications network 135 may be configured totransmit, generate, and receive any information and data traversing thesystem 100. In certain embodiments, the communications network 135 mayinclude any number of servers, databases, or other componentry, and maybe controlled by a service provider. The communications network 135 mayalso include and be connected to a cloud-computing network, a phonenetwork, a wireless network, an Ethernet network, a satellite network, abroadband network, a cellular network, a private network, a cablenetwork, the Internet, an internet protocol network, a contentdistribution network, any network, or any combination thereof.Illustratively, server 140 and server 150 are shown as being includedwithin communications network 135.

Notably, the functionality of the system 100 may be supported andexecuted by using any combination of the servers 140, 150, and 160. Theservers 140, and 150 may reside in communications network 135, however,in certain embodiments, the servers 140, 150 may reside outsidecommunications network 135. The servers 140, and 150 may be utilized toperform the various operations and functions provided by the system 100,such as those requested by applications executing on the first andsecond user devices 102, 111. In certain embodiments, the server 140 mayinclude a memory 141 that includes instructions, and a processor 142that executes the instructions from the memory 141 to perform variousoperations that are performed by the server 140. The processor 142 maybe hardware, software, or a combination thereof. Similarly, the server150 may include a memory 151 that includes instructions, and a processor152 that executes the instructions from the memory 151 to perform thevarious operations that are performed by the server 150. In certainembodiments, the servers 140, 150, and 160 may be network servers,routers, gateways, switches, media distribution hubs, signal transferpoints, service control points, service switching points, firewalls,routers, edge devices, nodes, computers, mobile devices, or any othersuitable computing device, or any combination thereof. In certainembodiments, the servers 140, 150 may be communicatively linked to thecommunications network 135, any network, any device in the system 100,or any combination thereof.

The database 155 of the system 100 may be utilized to store and relayinformation that traverses the system 100, cache information and/orcontent that traverses the system 100, store data about each of thedevices in the system 100, and perform any other typical functions of adatabase. In certain embodiments, the database 155 may store the outputfrom any operation performed by the system 100, operations performed andoutput generated by the first and second user devices 102, 111, theservers 140, 150, 160 or any combination thereof. In certainembodiments, the database 155 may store a record of any and allinformation obtained from any data sources utilized by the system 100 tofacilitate the operative functions of the system 100 and its components,any other data traversing the system 100, or any combination thereof. Incertain embodiments, the database 155 may be connected to or residewithin the communications network 135, any other network, or acombination thereof. In certain embodiments, the database 155 may serveas a central repository for any information associated with any of thedevices and information associated with the system 100. Furthermore, thedatabase 155 may include a processor and memory or be connected to aprocessor and memory to perform the various operations associated withthe database 155. In certain embodiments, the database 155 may beconnected to the servers 140, 150, 160, the first user device 102, thesecond user device 111, any devices in the system 100, any other device,any network, or any combination thereof.

The database 155 may also store information obtained from the system100, store detected hidden correlations, store known correlations, storegraphs generated by the system 100, store reduced graphs generated bythe system 100, store features computed from the graphs, storeinformation associated with the first and second users 101, 110, storelocation information for the first and second user devices 102, 111and/or first and second users 101, 110, store user profiles associatedwith the first and second users 101, 110, store device profilesassociated with any device in the system 100, store communicationstraversing the system 100, store user preferences, store demographicinformation for the first and second users 101, 110, store informationassociated with any device or signal in the system 100, storeinformation relating to usage of applications accessed by the first andsecond user devices 102, 111, store any information obtained from any ofthe networks in the system 100, store historical data associated withthe first and second users 101, 110, store device characteristics, storeinformation relating to any devices associated with the first and secondusers 101, 110, or any combination thereof. The user profiles mayinclude any type of information associated with an individual (e.g.first user 101 and/or second user 110), such as, but not limited to,contact information, demographic information, psychographic information,work history information, education information, any attributes of theindividual, any other information, or a combination thereof. Deviceprofiles may include any type of information associated with a device,such as, but not limited to, operating system information, hardwarespecifications, information about each component of the device (e.g.sensors, processors, memories, batteries, etc.), attributes of thedevice, any other information, or a combination thereof. In certainembodiments, the database 155 may store artificial intelligencealgorithms, machine learning algorithms, algorithms for performing anyoperations and/or calculations performed by the system 100, any type ofalgorithm, or any combination thereof. In certain embodiments, thedatabase 155 may be configured to store any information generated and/orprocessed by the system 100, store any of the information disclosed forany of the operations and functions disclosed for the system 100herewith, store any information traversing the system 100, or anycombination thereof. Furthermore, the database 155 may be configured toprocess queries sent to it by any device in the system 100.

The system 100 may also include a software application or program, whichmay be configured to perform and support the operative functions of thesystem 100. In certain embodiments, the application may be a softwareprogram, a website, a mobile application, a software application, asoftware process, or a combination thereof, which may be made accessibleto users utilizing one or more computing devices, such as first userdevice 102 and second user device 111. The application of the system 100may be accessible via an internet connection established with a browserprogram executing on the first or second user devices 102, 111, a mobileapplication executing on the first or second user devices 102, 111, orthrough other suitable means. Additionally, the application may allowusers and computing devices to create accounts with the application andsign-in to the created accounts with authenticating username andpassword log-in combinations. The application may include a customgraphical user interface that the first user 101 or second user 110 mayinteract with by utilizing a web browser executing on the first userdevice 102 or second user device 111. In certain embodiments, thesoftware application may execute directly as an installed program on thefirst and/or second user devices 102, 111, such as a mobile applicationor a desktop application.

The software application may include multiple programs and/or functionsthat execute within the software application and/or are accessible bythe software application. For example, the software application mayexecute code to perform the operative functions, which assist indiscovery hidden correlation relationships for risk analysis byutilizing graph-based machine learning. As another example, the softwareapplication may include an application that generates web content andpages that may be accessible to the first and/or second user devices102, 111, any type of program, or any combination thereof. Theapplication that generates web content and pages may be configured togenerate a graphical user interface for the software application that isaccessible and viewable by the first and second users 101, 110 when thesoftware application is loaded and executed on the first and/or secondcomputing devices 102, 111. The graphical user interface for thesoftware application may display content for viewing by the first and/orsecond users 101, 110 via the first and/or second user devices 102, 111.Additionally, the graphical user interface may display functionalityprovided by the software application that enables the second user 110and/or the second computing device 111 to interact with the softwareapplication and the modules supporting the software application'sfunctionality.

Notably, as shown in FIG. 1 , the system 100 may perform any of theoperative functions disclosed herein by utilizing the processingcapabilities of server 160, the storage capacity of the database 155, orany other component of the system 100 to perform the operative functionsdisclosed herein. The server 160 may include one or more processors 162that may be configured to process any of the various functions of thesystem 100. The processors 162 may be software, hardware, or acombination of hardware and software. Additionally, the server 160 mayalso include a memory 161, which stores instructions that the processors162 may execute to perform various operations of the system 100. Forexample, the server 160 may assist in processing loads handled by thevarious devices in the system 100, such as, but not limited to,generating graphs based on collected data; reducing graphs, such as byremoving edges from the graphs; computing the proximity betweenvertexes; computing graph features from graphs; determining non-graphfeatures; training a machine learning model with features computing fromthe graphs; predicting and/or detecting whether a hidden correlationrelationship exists between one or more pairs of vertexes (e.g. entitiesbeing monitored); and performing any other suitable operations conductedin the system 100 or otherwise. In one embodiment, multiple servers 160may be utilized to process the functions of the system 100. The server160 and other devices in the system 100, may utilize the database 155for storing data about the devices in the system 100 or any otherinformation that is associated with the system 100. In one embodiment,multiple databases 155 may be utilized to store data in the system 100.

Although FIG. 1 illustrates specific example configurations of thevarious components of the system 100, the system 100 may include anyconfiguration of the components, which may include using a greater orlesser number of the components. For example, the system 100 isillustratively shown as including a first user device 102, a second userdevice 111, a communications network 135, a server 140, a server 150, aserver 160, and a database 155. However, the system 100 may includemultiple first user devices 102, multiple second user devices 111,multiple communications networks 135, multiple servers 140, multipleservers 150, multiple servers 160, multiple databases 155, or any numberof any of the other components inside or outside the system 100.Furthermore, in certain embodiments, substantial portions of thefunctionality and operations of the system 100 may be performed by othernetworks and systems that may be connected to system 100.

Operatively and referring now also to FIGS. 2-14 , the system 100 may beconfigured to discover hidden correlation relationships for riskanalysis using graph-based machine learning, as is described herein andas shown in the following use-case scenario. Notably, the system 100 isnot intended to be limited to the loan use-case scenario describedherein, but may be utilized for detecting correlation relationships inany context and for any type of entities. In the banking use-casescenario, unveiled hidden correlation relationships impose a major riskfor bank's lending operations. However, in many cases, it is often verydifficult to sort out the hidden correlation relationships among acomplicated network of connections of tens or even hundreds of companiesand people related to a client. Notably, often these hiddenrelationships are designed in a way that makes outsiders like banksdifficult to find. The system 100 provides functionality that discoverssuch hidden relationships by collecting data of known relationships intograph databases (e.g. database 155) and training a machine learningmodel using features computed from the graph database.

There are many sources that can provide data, such as, but not limitedto banks, government agencies, news media and social networks,third-party agencies, among others. For each client, the bank's ownrecord has a substantial amount of information relating to loan history,credit, finance, transactions, etc. about the client, and whether theclient provides guarantees or collateral support to other clients orvice versa. Government agencies, such as the Securities ExchangeCommission, may also have information about stock holding changes.Similarly, published reports made by journalistic investigators mayreveal information about a company or individuals that are not known tobanks previously. With all the data available, the system 100 may definea set of correlation relationships that are important in characterizingthe overall financial and credit condition of clients. Theserelationships can include, but are not limited to shareholder, funding,guarantee, trading, personnel, collateral, transactions, otherrelationships, or any combination thereof. For each kind ofrelationship, the system 100 may define a degree of strength. Forexample, a strong shareholder relationship can be defined as anindividual or a company that has more than 50% of the shares of thecompany under consideration. Similarly, a medium shareholderrelationship can be defined as an individual or a company that has lessthan 50%, but more than 10% of the shares of the company. A weakshareholder relationship can be defined as an individual or a companyhas less than 10% of the shares of the company. One such example 200 isshown in FIG. 2 where John (e.g. first user 101) has a strongshareholder relationship with Company A.

The system 100 may then build a graph using the data, identifiedrelationship, and the strength of the relationship. The graph may beand/or include a simple graph, a multi-graph, or a combination thereof.The vertexes may be the companies or individuals that the system 100 ismonitoring. The edge may indicate the correlation relationship definedabove. The weight may be the strength of the relationship. For eachvertex or edge, there may be a set of properties. In this case, it maybe called a property graph. For example, for a vertex that represents anindividual person, the properties could include name, address, data ofbirth or data of founded, credit score, loan balance, etc. One example200 is shown in FIG. 2 where John has a strong shareholder relationshipwith company A and has a weak shareholder relationship with company B. Agraph may have tens of thousands of vertexes or any desired number ofvertexes. In certain embodiments, the vertexes (i.e. vertices) may beand/or may represent a company, an important person of the company, anydesired entity, or a combination thereof. A pair of vertexes can havemultiple edges. In certain embodiments, the edges may represent aninvestment relationship, a shareholder relationship, a fundingrelationship, a transactions relationship, a guarantee relationship, acollateral relationship, a trading relationship, a very important personrelationship, any kind of business relationship, any kind ofrelationship in general, or a combination thereof. For example, CompanyA and Company B can have guarantee relationship, but they can also havebusiness transactions relationships. Such a graph database may be storedin computer hard disk drives or memories and/or in database 155.

The hidden relationship discovery may be solved by formulating it as amachine learning problem. The steps to implement the machine learningmethod and system are as follows. The system 100 may compute a set offeatures from the graph database that is used as data to train themachine learning model, which may be called ML-Data henceforward. Incertain embodiments, the features may include network topology features,business-related features, any type of features, or a combinationthereof. In certain embodiments, features may be node-pair wise metricsbased on neighborhood, such as, but not limited to, common neighbors,Jaccard's coefficient, Adar Index, Salton Index, Leicht Index, SorensenIndex, Hub Index, resource allocation index, any other feature, or acombination thereof. In certain embodiments, the features may benode-pair wise metrics based on paths, such as, but not limited to, theshortest path distance, Katz distance, hitting time, the number of totalpaths, any type of path, or a combination thereof. In certainembodiments, the features may be computed from a subgraph containing twonodes of interest, such as the total vertexes and edges of the subgraphand the ratio of the number of edges over the nodes. In certainembodiments, features may be computed from circles that contain twovertexes and may be determined by the overlap of the two circles. Incertain embodiments, the features may be computed from properties of thetwo vertexes, such as, but not limited to, the money transaction amount,the number of guarantees/collaterals provided for each other and thetotal amount of guarantees/collaterals, the overlap in their names,emails, addresses, other properties, or a combination thereof. Seeillustration 1200 of FIG. 12 , for example. In certain embodiments,features may be computed for a single edge and/or for multiple edges. Incertain embodiments, positive labels may be given to node-pairs wheretwo nodes have a certain correlation relationship of interest, andnegative labels may be given to node-pairs where the two nodes do nothave a relationship of interest. In further embodiments, certainconstraints may be added to limit the shortest distance between twonegatively labeled nodes to a defined interval.

The first step for such a computation (i.e. computing a set of featuresfrom a graph) is for the system 100 to convert the original graph to aseries of reduced graphs by removing the edge(s) that represents thekind of relationship between two vertexes that the second user 110, forexample, wants to reveal. A major concept utilized for featurecomputation is a proximity measure that shows how close two vertexesare. For example, if one wants to discover if there is a hiddenshareholder relationship between two vertexes, the feature set can becomputed as follows. Taking the illustration 200 of FIG. 2 as anexample, we want to measure how close John and Company A is where thereis a shareholder edge between them, which the system 100 will use as aninput to the machine learning model as a feature. See also diagram 500of FIG. 5 regarding measuring the closeness between two vertexes. Inorder to do that, the system 100 first converts the original graph to areduced graph by removing the shareholder edge connecting John andCompany A. That is, the system 100 ends up with a graph as shown in theillustration 600 of FIG. 6 and/or at the bottom of the illustration 800of FIG. 8 . For this graph, we define a set of measures thatcharacterize how close John and Company A are. As shown in theillustration 1100 of FIG. 11 , these include, but are not limited to,the number of paths between them and the sum of the (weighted) pathlength, shortest distance, common neighbors, Jaccard's coefficient,resource allocation coefficient, Adamic Index, preferential attachmentIndex, Katz, hitting time, commute time, rooted PageRank, SimRank, HubIndex, Salton Index, Sorensen Index, etc. These metrics are allgraphed-based metrics and can be computed based on the whole graph or areduced graph as shown at the bottom of FIG. 8 or a subgraph of thereduced graph. For example, a subgraph can be defined as part of theoriginal reduced graph that has edges where all or some of the edgesrepresent the same correlation relationship or a combination of severalcorrelation relationships. In certain embodiments, if this is a propertygraph, the subgraph can be defined as part of the original reduced graphwhere all or some of the edges represent the same property or acombination of several properties. Referring now also to illustration900 of FIG. 9 , in another embodiment, the subgraph could be the unionof the (strongly) connected components, the cycles or the ego nets orthe combination of them of the two vertexes under consideration. Incertain embodiments, these (strongly) connected components, cycles orego nets could be further reduced by specifying certain correlationrelationships or properties only. In certain embodiments, the subgraphmay be created by a community detection method, such as, but not limitedto the Louvain method. In certain embodiments, some of the graph-basedproximity metrics may be defined for simple graphs only where there isonly one edge between any two vertexes. In order to compute thesemetrics for the multigraph where there are multiple edges, the graph maybe converted to a simple graph. This may be done by converting multipleedges to one edge with or without a weight. In certain embodiments, whenthe weight does not take into account the number of edges, these metricsmay be computed as usual. On the other hand, in certain embodiments, theweight may be set to reflect the impact of multiple edges. For example,suppose there are three edges between two vertexes A and B. Then forpath-based metrics like shortest distance, the multiple edges betweentwo vertexes can be combined as one edge with a weight of the inverse ofthe number of edges, e.g., ⅓ for this example. For neighborhood-basedmetrics like Common Neighbors, a different weight may be used. Forexample, vertex A has three edges with its neighbor vertex B, whilevertex C has two edges with its neighbor B. The system 100 may firstconvert the multiple edges between A and B to one edge. Similarprocessing may be performed for C and B. See also illustration 700 ofFIG. 7 . The common neighbors between A and C is 1, i.e., vertex B.Then, the system 100 may multiply this number by the number of originalmultiple edges between A and B and between B and C, that is, the system100 may multiply the common neighbors “1” by 3*2 and the system 100determines that the final common neighbors 6. That is equivalent to givea weight of 3 to the new one single edge between A and B and a weight of2 to the new one single edge between C and B. In certain embodiments,another set of features are metrics related to the node itself, such as,but not limited to, PageRank, in and out degrees, centralities, etc. Incertain embodiments, a further set of features are related to the wholesubgraph itself, such as, but not limited to, the total number of edgesand nodes of the subgraph, and/or the ratio of the number of edges overthe number of nodes.

Another set of features based on business/personnel relationship can becomputed by the system 100. For example, if company A is a vertex of thesubgraph created by the (strongly) connected components or cycles byJohn with one or more of the correlation relationship or vice versa. Tobe more specific, suppose John has a cycle consisted by vertexes who areconnected by a guarantee relationship. Then, if company A is a vertex inthis cycle, i.e., company A is part of the guarantee cycle of John, thenthe corresponding value for this feature would be “1”. Otherwise thevalue for this feature is “0”. A normalized version of this feature maybe computed by dividing the feature value by the number of vertexes inthis cycle except the vertexes pair under consideration. In certainembodiments, another type of cycle-related feature could be to find thecycles of the two nodes and count how many common nodes or edges sharedby the cycles of the two nodes if the cycles are not the same. Incertain embodiments, a normalized version can be calculated by dividingthe number of overlap edges by the number of total edges. Another typeof feature may be computed by determining if one vertex is on a certainpath of the other vertex, e.g., if John is connected to Company A by apath with vertexes consisted by collateral correlation relationships orvice versa. If it is true, the feature value would be “1”, otherwise, itwould be “0”. Furthermore, the system 100 can compute a normalizedversion of this. E.g., Suppose John is in the collateral path of CompanyA defined above then another feature may be computed by dividing it bythe number vertexes that have a collateral path with Company A. Yetanother consideration is for the system 100 to acquire the data andgenerate the graph database at different time points, e.g. to generate agraph database based on the information at each month. Then, the system100 can generate features using the same procedure as above for each ofthese graphs. This is a way to achieve data augmentation, e.g., toexpand the size of data available for machine learning. This isparticularly useful for deep learning which often requires a lot oftraining data. A set of non-topology features may be computed based onthe information for the vertexes and edges, which are often stored inproperties for a property graph. For example, such features couldinclude the name, address, email, etc. or the difference in name,address, email, etc., or if they are in the same industry/geolocationfor the companies or individuals, as shown in the illustration 1200 ofFIG. 12 . Other types of business related non-topology features mayinclude the money transaction amount, the number ofguarantees/collaterals provided for each other, the total amount ofguarantees/collaterals of these two nodes within a certain amount oftime, any other non-topology feature, or a combination thereof.

A vector or matrix consisting of these features computed for John andCompany A, as an example, is used as an input to the machine learningmodel. The corresponding target label on the right end of FIG. 4 and inillustration 1300 of FIG. 13 will be “1” as there is indeed ashareholder relationship between John and Company A. See alsoillustration 1000 of FIG. 10 . Similarly, we can compute the same set offeatures for other pairs of vertexes where there is a shareholder edgeconnecting them, such as John and Company B, Alice and Company B, andAlice and Company C. For vertex pairs where there is no shareholder edgeconnecting them such as John and Company C, the system 100 may computethe same set of features in the original whole graph or a series ofsubgraphs of the original whole graph generated in the same way as thecase when there is a shareholder relationship between two vertexes. Butthe corresponding target label for training target will be “0” in thisinstance, as shown in FIG. 13 and in FIG. 10 . These pairs of featuresand the target label comprise the ML-Data. A pair in the ML-Data set maybe composed by a set of features computed from two vertexes and acorresponding target label, e.g., 1 and 0 for a supervised binaryclassification. Therefore, the hidden relationship discovery problem maybe converted to a supervised binary classification problem. The system100 may then proceed to determining if there is a hidden relationshipbetween Alice and Company A and/or any of the other companies, as isshown in illustration 1400 of FIG. 14 .

After the system 100 has the ML-Data consisting of the pairs of featuresand corresponding target labels, the system 100 may enter the phase ofthe training process to build machine learning model. This is shown inthe illustration 1300 of FIG. 13 , for example. Usually before thetraining, the system 100 may split the ML-Data set into three parts:training data set, validation data set and test data set. The test dataset could also be computed from completely new data which has not beenused in the computation of ML-Data mentioned above, e.g. from incomingnew clients. The training data set may be used to train the model, whilethe validation data set may be used to evaluate and optimize thegeneralization performance of the model. For each iteration step, one ormore pairs of ML-data may be used as inputs in the model. Supervisedtraining algorithms may include, but are not limited to, logisticregression, SVM, random forest, gradient boosting decision trees or deepneural network (deep learning). The training process may stop when itsperformance on validation data is satisfactory. The trained machinelearning model may be used to predict if there is a hidden relationshipbetween a pair of two vertexes. The graph goes through the same featurecomputation process, which provides a set of features defined the sameas those for training. The features may be fed to the trained machinelearning model and the output of the machine learning model may detectthe hidden correlation relationship. The output could be a binaryoutput, e.g., 0 for no hidden relationship and 1 for the existence of ahidden relationship, or a probability, which represents the likelihoodof the existence of a hidden relationship. An example 1400 is shown inFIG. 14 .

As shown in FIG. 15 , an exemplary method 1500 for discovering hiddencorrelation relationships for risk analysis using graph-based machinelearning is schematically illustrated. The method 1500 may begin at step1502, which may include collecting data associated with knowncorrelation relationships that exist amount of a plurality of entities.In certain embodiments, the data may include information associated withthe known correlation relationships and an indication of a strength ofthe known correlation relationships. In certain embodiments, thecollecting may be performed and/or facilitated by utilizing the firstuser device 102, the second user device 111, the servers 140, 150, 160,the database 155, the communications network 135, any combinationthereof, or by utilizing any other appropriate program, network, system,component, and/or device. As step 1504, the method 1500 may includegenerating a graph based on the known correlation relationships and thestrength of the known correlation relationships. In certain embodiments,the vertexes (i.e. vertices) of the graph may correspond to theplurality of entities and the edges of the graph may correspond to theknown correlation relationships. In certain embodiments, the generatingmay be performed and/or facilitated by utilizing the first user device102, the second user device 111, the servers 140, 150, 160, the database155, the communications network 135, any combination thereof, or byutilizing any other appropriate program, network, system, component,and/or device.

At step 1506, the method 1500 may include computing, based on thegenerated graph, a set of features and/or corresponding labels for theplurality of entities. The computing of the features and/orcorresponding labels may be performed and/or facilitated by utilizingthe first user device 102, the second user device 111, the servers 140,150, 160, the database 155, the communications network 135, anycombination thereof, or by utilizing any other appropriate program,network, system, component, and/or device. Once the set of featuresand/or corresponding labels of the plurality of entities are computed,the method 1500 may proceed to step 1508, which may include training amachine learning model using the computed set of features and thecorresponding labels. In certain embodiments, the training may beperformed and/or facilitated by utilizing the first user device 102, thesecond user device 111, the servers 140, 150, 160, the database 155, thecommunications network 135, any combination thereof, or by utilizing anyother appropriate program, network, system, component, and/or device.The method 1500 may proceed to step 1510, which may include determininga hidden correlation relationship for at least one pair of the pluralityof entities by utilizing the machine learning model trained with thecomputed set of features and/or labels. In certain embodiments, thedetermining of the hidden correlation relationship may be performedand/or facilitated by utilizing the first user device 102, the seconduser device 111, the servers 140, 150, 160, the database 155, thecommunications network 135, any combination thereof, or by utilizing anyother appropriate program, network, system, component, and/or device.

The systems and methods may include further functionality and features.For example, the system 100 may generate a series of graphs fordifferent time points and, as a result, features may be computed for thegraphs at each time point. In certain embodiments, the machine learningmodels of the system 100 may be trained by applying support vectormachine (SVM), deep neural networks, gradient boosting, decision trees,random forests, logistic regressions, any other training technique, or acombination thereof. In certain embodiments, the machine learning modelmay be trained in a supervised, semi-supervised, and/or unsupervisedmanner. In further embodiments, the system 100 and methods disclosedherein may be utilized to find hidden relationships among two or moreentities in anti-money laundering, anti-terrorist, and/or other lawenforcement investigations. As shown in the diagrams 300 and 400 ofFIGS. 3 and 4 , the system 100 may be configured to support linkprediction and/or completion. In doing so, the system 100 may utilize aplurality of steps to discovering hidden relationships. The steps mayinclude converting it to a machine learning problem, creating trainingdata sets from existing data and/or graph databases, and conductingfeature engineering.

The systems and methods disclosed herein may include still furtherfunctionality and features. For example, the operative functions of thesystem 100 and method may be configured to execute on a special-purposeprocessor specifically configured to carry out the operations providedby the system 100 and method. Notably, in certain embodiments, variousfunctions and features of the system 100 and methods may operate withouthuman intervention and may be conducted entirely by computing devices,robots, programs, and/or processes. For example, in certain embodiments,multiple computing devices may interact with devices of the system 100to provide the functionality supported by the system 100. In certainembodiments, the system 100 and methods may also provide effectivecomputing resource management by utilizing the features and functionsdescribed in the present disclosure. For example, in certainembodiments, while performing certain actions the system 100 may specifya quantity of computer processor resources (e.g. processor clock cycles,processor speed, processor cache, etc.) that may be dedicated tocomputing the features from the graphs, reducing the graphs, predictingand/or detecting the hidden correlation relationships, and performingany other operations conducted by the system 100, or any combinationthereof. For example, the system 100 or an application of the system 100may indicate a quantity of processor cycles of a processor that may beutilized to obtain data, process obtained data, and/or specify aselected amount of processing power that may be dedicated to performingactions conducted by the system 100.

In certain embodiments, any device in the system 100 may transmit asignal to a memory device to cause the memory device to only dedicate aselected amount of memory resources to the various operations of thesystem 100. In certain embodiments, the system 100 and methods may alsoinclude transmitting signals to processors and memories to only performthe operative functions of the system 100 and methods at time periodswhen usage of processing resources and/or memory resources in the system100 is at a selected and/or threshold value. In certain embodiments, thesystem 100 and methods may include transmitting signals to the memorydevices utilized in the system 100, which indicate which specificportions (e.g. memory sectors, etc.) of the memory should be utilized tostore any of the data utilized or generated by the system 100. Notably,the signals transmitted to the processors and memories may be utilizedto optimize the usage of computing resources while executing theoperations conducted by the system 100. As a result, such featuresprovide substantial operational efficiencies and improvements overexisting technologies.

Referring now also to FIG. 16 , at least a portion of the methodologiesand techniques described with respect to the exemplary embodiments ofthe system 100 can incorporate a machine, such as, but not limited to,computer system 1600, or other computing device within which a set ofinstructions, when executed, may cause the machine to perform any one ormore of the methodologies or functions discussed above. The machine maybe configured to facilitate various operations conducted by the system100. For example, the machine may be configured to, but is not limitedto, assist the system 100 by providing processing power to assist withprocessing loads experienced in the system 100, by providing storagecapacity for storing instructions or data traversing the system 100, orby assisting with any other operations conducted by or within the system100.

In some embodiments, the machine may operate as a standalone device. Insome embodiments, the machine may be connected (e.g., usingcommunications network 135, another network, or a combination thereof)to and assist with operations performed by other machines and systems,such as, but not limited to, the first user device 102, the second userdevice 111, the server 140, the server 150, the database 155, the server160, or any combination thereof. In certain embodiments, the machine mayassist with operations performed by any programs in the system. Themachine may be connected with any component in the system 100. In anetworked deployment, the machine may operate in the capacity of aserver or a client user machine in a server-client user networkenvironment, or as a peer machine in a peer-to-peer (or distributed)network environment. The machine may comprise a server computer, aclient user computer, a personal computer (PC), a tablet PC, a laptopcomputer, a desktop computer, a control system, a network router, switchor bridge, or any machine capable of executing a set of instructions(sequential or otherwise) that specify actions to be taken by thatmachine. Further, while a single machine is illustrated, the term“machine” shall also be taken to include any collection of machines thatindividually or jointly execute a set (or multiple sets) of instructionsto perform any one or more of the methodologies discussed herein.

The computer system 1600 may include a processor 1602 (e.g., a centralprocessing unit (CPU), a graphics processing unit (GPU, or both), a mainmemory 1604 and a static memory 1606, which communicate with each othervia a bus 1608. The computer system 1600 may further include a videodisplay unit 1610, which may be, but is not limited to, a liquid crystaldisplay (LCD), a flat panel, a solid state display, or a cathode raytube (CRT). The computer system 1600 may include an input device 1612,such as, but not limited to, a keyboard, a cursor control device 1614,such as, but not limited to, a mouse, a disk drive unit 1616, a signalgeneration device 1618, such as, but not limited to, a speaker or remotecontrol, and a network interface device 1620.

The disk drive unit 1616 may include a machine-readable medium 1622 onwhich is stored one or more sets of instructions 1624, such as, but notlimited to, software embodying any one or more of the methodologies orfunctions described herein, including those methods illustrated above.The instructions 1624 may also reside, completely or at least partially,within the main memory 1604, the static memory 1606, or within theprocessor 1602, or a combination thereof, during execution thereof bythe computer system 1600. The main memory 1604 and the processor 1602also may constitute machine-readable media.

Dedicated hardware implementations including, but not limited to,application specific integrated circuits, programmable logic arrays andother hardware devices can likewise be constructed to implement themethods described herein. Applications that may include the apparatusand systems of various embodiments broadly include a variety ofelectronic and computer systems. Some embodiments implement functions intwo or more specific interconnected hardware modules or devices withrelated control and data signals communicated between and through themodules, or as portions of an application-specific integrated circuit.Thus, the example system is applicable to software, firmware, andhardware implementations.

In accordance with various embodiments of the present disclosure, themethods described herein are intended for operation as software programsrunning on a computer processor. Furthermore, software implementationscan include, but not limited to, distributed processing orcomponent/object distributed processing, parallel processing, or virtualmachine processing can also be constructed to implement the methodsdescribed herein.

The present disclosure contemplates a machine-readable medium 1622containing instructions 1624 so that a device connected to thecommunications network 135, another network, or a combination thereof,can send or receive voice, video or data, and communicate over thecommunications network 135, another network, or a combination thereof,using the instructions. The instructions 1624 may further be transmittedor received over the communications network 135, another network, or acombination thereof, via the network interface device 1620.

While the machine-readable medium 1622 is shown in an example embodimentto be a single medium, the term “machine-readable medium” should betaken to include a single medium or multiple media (e.g., a centralizedor distributed database, and/or associated caches and servers) thatstore the one or more sets of instructions. The term “machine-readablemedium” shall also be taken to include any medium that is capable ofstoring, encoding or carrying a set of instructions for execution by themachine and that causes the machine to perform any one or more of themethodologies of the present disclosure.

The terms “machine-readable medium,” “machine-readable device,” or“computer-readable device” shall accordingly be taken to include, butnot be limited to: memory devices, solid-state memories such as a memorycard or other package that houses one or more read-only (non-volatile)memories, random access memories, or other re-writable (volatile)memories; magneto-optical or optical medium such as a disk or tape; orother self-contained information archive or set of archives isconsidered a distribution medium equivalent to a tangible storagemedium. The “machine-readable medium,” “machine-readable device,” or“computer-readable device” may be non-transitory, and, in certainembodiments, may not include a wave or signal per se. Accordingly, thedisclosure is considered to include any one or more of amachine-readable medium or a distribution medium, as listed herein andincluding art-recognized equivalents and successor media, in which thesoftware implementations herein are stored.

The illustrations of arrangements described herein are intended toprovide a general understanding of the structure of various embodiments,and they are not intended to serve as a complete description of all theelements and features of apparatus and systems that might make use ofthe structures described herein. Other arrangements may be utilized andderived therefrom, such that structural and logical substitutions andchanges may be made without departing from the scope of this disclosure.Figures are also merely representational and may not be drawn to scale.Certain proportions thereof may be exaggerated, while others may beminimized. Accordingly, the specification and drawings are to beregarded in an illustrative rather than a restrictive sense.

Thus, although specific arrangements have been illustrated and describedherein, it should be appreciated that any arrangement calculated toachieve the same purpose may be substituted for the specific arrangementshown. This disclosure is intended to cover any and all adaptations orvariations of various embodiments and arrangements of the invention.Combinations of the above arrangements, and other arrangements notspecifically described herein, will be apparent to those of skill in theart upon reviewing the above description. Therefore, it is intended thatthe disclosure not be limited to the particular arrangement(s) disclosedas the best mode contemplated for carrying out this invention, but thatthe invention will include all embodiments and arrangements fallingwithin the scope of the appended claims.

The foregoing is provided for purposes of illustrating, explaining, anddescribing embodiments of this invention. Modifications and adaptationsto these embodiments will be apparent to those skilled in the art andmay be made without departing from the scope or spirit of thisinvention. Upon reviewing the aforementioned embodiments, it would beevident to an artisan with ordinary skill in the art that saidembodiments can be modified, reduced, or enhanced without departing fromthe scope and spirit of the claims described below.

We claim:
 1. A system, comprising: a memory that stores instructions;and a processor that executes the instructions to perform operations,the operations comprising: collecting data associated with knowncorrelation relationships that exist among a plurality of entities;accessing the data associated with the known correlation relationshipsthat exist among a plurality of entities, wherein the data comprisesinformation associated with the known correlation relationships and anindication of a strength of the known correlation relationships;generating a graph based on the known correlation relationships and thestrength of the known correlation relationships, wherein vertexes of thegraph correspond to the plurality of entities and edges of the graphcorrespond to the known correlation relationships; computing, based onthe graph, a set of features and corresponding labels for the pluralityof entities, wherein the set of features and the corresponding labelsare computed based on converting the graph to a reduced graph byremoving an edge of the edges of the graph representing a type ofrelationship between a pair of vertexes of the vertexes that is soughtto be revealed from being hidden, wherein at least one feature of theset of features is computed by utilizing a proximity measure indicatinga measure of how close each vertex of the pair of vertexes are to eachother, wherein the proximity measure indicates a number of paths betweenthe pair of vertexes and a sum of a weighted path length; training amachine learning model using the computed set of features and thecorresponding labels; and determining a hidden correlation relationshipbetween a first entity of the plurality of entities and at least oneadditional entity of the plurality of entities by utilizing the machinelearning model trained with the computed set of features, wherein thehidden correlation relationship is displayed to a user on a first userdevice to assist the user in making a decision regarding the firstentity.
 2. The system of claim 1, wherein the graph comprises a simplegraph, a multi-graph, or a combination thereof.
 3. The system of claim1, wherein the vertexes of the graph comprise a company, an importantperson of the company, or a combination thereof.
 4. The system of claim1, wherein the edges represent an investment relationship, a shareholderrelationship, a funding relationship, a transactions relationship, aguarantee relationship, a collateral relationship, a tradingrelationship, a very important person (VIP) relationship, any type ofrelationship, any type of business relationship, or a combinationthereof.
 5. The system of claim 1, wherein the features of the set offeatures include network topology features and business-relatedfeatures.
 6. The system of claim 1, wherein the features of the set offeatures are based on neighborhood and comprise node-pair wise metricscomprising common neighbors, Jaccard's coefficient, Adar Index, SaltonIndex, Leicht Index, Sorensen Index, Hub Index, Resource AllocationIndex, or a combination thereof.
 7. The system of claim 1, whereinfeatures of the set of features comprise node-pair wise metrics based onpaths including a shortest path distance, a Katz distance, a hittingtime, a number of total paths, or a combination thereof.
 8. The systemof claim 1, wherein the features of the set of features are computedfrom one or more of: a subgraph containing two nodes of interest,including the total vertexes and edges of the subgraph and the ratio ofthe number of edges over the nodes; circles that contain two vertexes ofthe vertexes and are determined by an overlap of the circles; orproperties of the vertexes, wherein the properties comprise a moneytransaction amount, a number of guarantees provided for each other, anumber of collaterals provided for each other, a total amount of theguarantees, a total amount of the collaterals, an overlap in names,emails, addresses, or a combination thereof.
 9. The system of claim 1,wherein the features of the set of features are computed for a singleedge of the edges and multiple edges of the edges.
 10. The system ofclaim 1, wherein the operations further comprise: providing positivelabels to node-pairs where two nodes have a certain correlationrelationship of interest; and providing negative labels to node-pairswhere the two nodes do not have the correlation relationship ofinterest.
 11. The system of claim 10, wherein the operations furthercomprise: generating a series of graphs for different time points; andcomputing additional features for the graph at each of the differenttime points.
 12. The system of claim 1, wherein the third-party datasources include information provided by government agencies, news media,social networks, third-party agencies, public announcements made by theplurality of entities, or a combination thereof.
 13. The system of claim1, wherein the data includes loan histories, credit histories, financialinformation, trading and economic information, shareholder information,and transactional information.
 14. A method, comprising: accessing dataassociated with known correlation relationships that exist among aplurality of entities, wherein the data comprises information associatedwith the known correlation relationships and an indication of a strengthof the known correlation relationships; generating a graph based on theknown correlation relationships and the strength of the knowncorrelation relationships, wherein vertexes of the graph correspond tothe plurality of entities and edges of the graph correspond to the knowncorrelation relationships; computing, based on the graph, a set offeatures and corresponding labels for the plurality of entities, whereinthe set of features and the corresponding labels are computed based onconverting the graph to a reduced graph by removing an edge of the edgesof the graph representing a type of relationship between a pair ofvertexes of the vertexes that is sought to be revealed from beinghidden, wherein at least one feature of the set of features is computedby utilizing a proximity measure indicating a measure of how close eachvertex of the pair of vertexes are to each other, wherein the proximitymeasure indicates a number of paths between the pair of vertexes and asum of a weighted path length; training a machine learning model usingthe computed set of features and the corresponding labels; determining,by utilizing instructions from a memory that are executed by aprocessor, a hidden correlation relationship between a first entity ofthe plurality of entities and at least one additional entity of theplurality of entities by utilizing the machine learning model trainedwith the computed set of features; and displaying, on a user device, thehidden relationship to a user using the user device to assist the userin making a decision regarding the first entity.
 15. The method of claim14, further comprising training the machine learning model by utilizingsupport vector machines, deep neural networks, gradient boosting,decision trees, random forests, logistic regression, or a combinationthereof.
 16. The method of claim 14, further comprising training themachine learning model in a supervised, semi-supervised, or unsupervisedmanner.
 17. The method of claim 14, further comprising determining anadditional hidden correlation relationship among two or more entities ofthe plurality of entities for anti-money laundering, anti-terrorist, orother law enforcement investigations.
 18. The method of claim 14,further comprising: providing positive labels to node-pairs where twonodes have a certain correlation relationship of interest; and providingnegative labels to node-pairs where the two nodes do not have thecorrelation relationship of interest.
 19. The method of claim 14,further comprising: generating a series of graphs for different timepoints; and computing additional features for the graph at each of thedifferent time points.
 20. A non-transitory computer-readable devicecomprising instructions, which when loaded and executed by a processor,cause the processor to perform operations comprising: receiving dataassociated with known correlation relationships that exist among aplurality of entities, wherein the data comprises information associatedwith the known correlation relationships and an indication of a strengthof the known correlation relationships; generating a graph based on theknown correlation relationships and the strength of the knowncorrelation relationships, wherein vertexes of the graph correspond tothe plurality of entities and edges of the graph correspond to the knowncorrelation relationships; computing, based on the graph, a set offeatures and corresponding labels for the plurality of entities, whereinthe set of features and the corresponding labels are computed based onconverting the graph to a reduced graph by removing an edge of the edgesof the graph representing a type of relationship between a pair ofvertexes of the vertexes that is sought to be revealed from beinghidden, wherein at least one feature of the set of features is computedby utilizing a proximity measure indicating a measure of how close eachvertex of the pair of vertexes are to each other, wherein the proximitymeasure indicates a number of paths between the pair of vertexes and asum of a weighted path length; training a machine learning model usingthe computed set of features and the corresponding labels; determining ahidden correlation relationship between a first entity of the pluralityof entities and at least one additional entity of the plurality ofentities by utilizing the machine learning model trained with thecomputed set of features; and displaying, on a user device, the hiddencorrelation relationship to a user using the user device to assist theuser in making a decision regarding the first entity.